UPPAAL Implementation Secrets
نویسندگان
چکیده
In this paper we present the continuous and on-going development of datastructures and algorithms underlying the verification engine of the tool Uppaal. In particular, we review the datastructures of Difference Bounded Matrices, Minimal Constraint Representation and Clock Difference Diagrams used in symbolic state-space representation and -analysis for real-time systems. In addition we report on distributed versions of the tool, and outline the design and experimental results for new internal datastructures to be used in the next generation of Uppaal. Finally, we mention work on complementing methods involving acceleration, abstraction and compositionality.
منابع مشابه
Online Testing of Real-Time Systems Using UPPAAL: Status and Future Work
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based on a sound and complete randomized online testing algorithm and is implemented using symbolic state representation and manipulation techniques. We propose the notion of relativized timed input/output conformance as the f...
متن کاملEfficient Symbolic State Exploration of Timed Systems: Theory and Implementation
Timing aspects are important for the correctness of safety-critical systems. It is crucial that they are carefully analysed in designing such systems. UPPAAL is a tool designed to automate the analysis process. In UPPAAL, a system under construction is described as a network of timed automata and the desired properties of the system can be specified using a query language. Then UPPAAL can be us...
متن کاملOnline Testing of Real- ime Systems Using UPPAAL
We present T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifi cations. We describe a sound and complete randomized online testing algorithm and how to implement it using symbolic state representation and manipulation techniques. We propose the notion of relativized timed input/output conformance as the formal implementa...
متن کاملComputer Science at Kent Verification of Timed Automata with Deadlines in Uppaal
Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more naturalrepresentation of urgent actions, with the additional advantage of avoiding the most common form oftimelocks. We offer a compositional translation of a practically useful subset of TAD to timed safetyautomata (the well-known variant of timed automata where time progress conditions are expre...
متن کاملNew Uppaal Architecture
We present the design of the new model-checking engine architecture and new internal data structures for the next generation of Uppaal. Experimental results demonstrate that the new implementation based on these structures improves the efficiency of Uppaal by about 80% in both time and space. In addition, the new version is built to handle hierarchical models. The challenge in handling hierarch...
متن کامل